Relational Processing of Conflicting Arguments
نویسندگان
چکیده
منابع مشابه
Resolving Conflicting Arguments under Uncertainties
Distributed knowledge based applications in open domain rely on common sense infor mation which is bound to be uncertain and incomplete. To draw the useful conclusions from ambiguous data, one must address un certainties and conflicts incurred in a holis tic view. No integrated frameworks are vi able without an in-depth analysis of con flicts incurred by uncertainties. In this pa per, we ...
متن کاملOpportunistic Processing in Arguments
In two previous papers, we have proposed a part of a computational theory of argumentation, including representations for argument structure and rules for using those representations in understanding and in rebutting (Birnbaum et ai (1980) and Flowers et al (1981); related work includes Cohen (1980)). One property of the model which we emphasized is the way in which argument mechanisms and infe...
متن کاملConflicting viewpoint relational database querying: an argumentation approach
Within the framework of the European project EcoBioCap, we model a real world use case aiming at conceiving the next generation of food packagings. The objective is to select packaging materials according to possibly conflicting requirements expressed by the involved parties (food and packaging industries, health authorities, consumers, waste management authority, etc.). The requirements and us...
متن کاملTopographic Processing of Relational Data
Recently, batch optimization schemes of the self-organizing map (SOM) and neural gas (NG) have been modified to so-called median variants which allow a transfer of these methods to arbitrary distance measures beyond the standard euclidean metric. This principle is particularly suitable for complex applications where data are compared by means of problem-specific, possibly discrete metrics such ...
متن کاملGroupwise Processing of Relational Queries
In this paper, we define and examine a particular class of queries called group queries. Group queries are natural queries in many decisionsupport applications. The main characteristic of a group query is that it can be executed in a groupby-group fashion. In other words, the underlying relation(s) can be partitioned (based on some set of attributes) into disjoint groups, and each group can be ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Comprehensive Psychology
سال: 2016
ISSN: 2165-2228,2165-2228
DOI: 10.1177/2165222816657801